Construction of Irregular QC-LDPC Codes in Near-Earth Communications
نویسندگان
چکیده
—High-speed, high-reliability requirements and strict power limitation of near-earth communications yield that the channel coding must have high coding gain and lower error floor. In this paper, an irregular quasi-cyclic low-density paritycheck (QC-LDPC) code for specific use in near-earth communications is proposed. In order to eliminate the impact of short-cycles and further improve the performance of codes, a base matrix with girth at least 8 is employed. Then dualdiagonal structure is adopted in parity check matrix to reduce encoding complexity. Besides, circulant permutation matrices and zero matrices with different sizes are used to fill the nonzero positions and zero positions of the base matrix so as to remove the complexity of the selection of cyclic shift coefficients. The adoption of circulant permutation matrices with different sizes ensures that the parity check matrix is full rank, which makes the code rate controllable. Finally, simulation results are given to demonstrate the performance of the constructed codes by comparing with several existing codes.
منابع مشابه
An Unnoticed Strong Connection Between Algebraic-Based and Protograph-Based LDPC Codes, Part II: Nonbinary Case and Code Construction
This paper is the second part of a series of two papers on the investigation of the connection between two methods for constructing LDPC codes, namely the superposition and the protograph-based methods. In the first part, by taking the graph point of view, we established a strong connection between these two construction methods and showed that, in the binary case, the protograph-based construc...
متن کاملA Graphical Model and Search Algorithm Based Quasi-Cyclic Low-Density Parity-Check Codes Scheme
A constant challenge in Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes lies on flexible code lengths and rates, conditioned by good error performance. This paper presents an optimal construction method of QC-LDPC Codes on the basis of graphical model and search algorithm. Utilizing the proposed scheme, we can construct adaptable QC-LDPC codes whose girths are no less than 12, and column ...
متن کاملTight lower bound of consecutive lengths for QC-LDPC codes with girth twelve
For an arbitrary (3,L) QC-LDPC code with a girth of twelve, a tight lower bound of the consecutive lengths is proposed. For an arbitrary length above the bound the resultant code necessarily has a girth of twelve, and for the length meeting the bound, the corresponding code inevitably has a girth smaller than twelve. The conclusion can play an important role in the proofs of the existence of la...
متن کاملDesign and Implementation of Low Density Parity Check Codes
This article explains the design and implementation of both regular and irregular LDPC codes as carried out by me at the Institute of Communications Engineering, Technical University of Munich. The design of a good irregular LDPC code needs a pair of distributions to be specified. This article discusses a randomized construction which attempts to form a parity check matrix whose row and coloumn...
متن کاملImproving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCM
دوره 9 شماره
صفحات -
تاریخ انتشار 2014